منابع مشابه
The Magnets Puzzle is NP-Complete
In a Magnets puzzle, one must pack magnets in a box subject to polarity and numeric constraints. We show that deciding solvability of Magnets instances is NP-complete.
متن کاملZen Puzzle Garden is NP-complete
• Once moving on sand, the monk continues to move in a straight line until he encounters either a walkable square (in which case he moves onto it) or a a raked square (in which case he stops moving). The monk may not turn corners during a single move while moving on sand. These two rules are central to the challenge of the game – if the monk could be moved over the sand on a square-by-square ba...
متن کاملBust-a-Move/Puzzle Bobble Is NP-complete
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof applies to the perfect-information version where the bubble sequence is known in advance, and it uses just three bubble colors. “A girl runs up with somethin’ to prove. So don’t just stand there. Bust a move!” — Young MC [YDD89]
متن کاملOverloading is NP - complete
We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2012
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.20.707